Ashwini Index of a Graph
نویسنده
چکیده مقاله:
Motivated by the terminal Wiener index, we define the Ashwini index $mathcal{A}$ of trees as begin{eqnarray*} % nonumber to remove numbering (before each equation) mathcal{A}(T) &=& sumlimits_{1leq i
منابع مشابه
Ashwini Index of a Graph
+ degT (N(vj))], where dT (vi, vj) is the distance between the vertices vi, vj ∈ V (T ), is equal to the length of the shortest path starting at vi and ending at vj and degT (N(v)) is the cardinality of degT (u), where uv ∈ E(T ). In this paper, trees with minimum and maximum A are characterized and the expressions for the Ashwini index are obtained for detour saturated trees T3(n), T4(n) as we...
متن کاملashwini index of a graph
motivated by the terminal wiener index, we define the ashwini index $mathcal{a}$ of trees as begin{eqnarray*} % nonumber to remove numbering (before each equation) mathcal{a}(t) &=& sumlimits_{1leq i&+& deg_{_{t}}(n(v_{j}))], end{eqnarray*} where $d_{t}(v_{i}, v_{j})$ is the distance between the vertices $v_{i}, v_{j} in v(t)$, is equal to the length of the shortest path start...
متن کاملPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کاملA note on hyper-Zagreb index of graph operations
In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].
متن کاملBounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملA Note on Revised Szeged Index of Graph Operations
Let $G$ be a finite and simple graph with edge set $E(G)$. The revised Szeged index is defined as $Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$ where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and $n_{G}(e)$ is the number of equidistant vertices of $e$ in $G$. In this paper...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 8 شماره 4
صفحات 377- 384
تاریخ انتشار 2016-11-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023